منابع مشابه
Discrete Partitioning and Coverage Control with Gossip Communication
In this paper we propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. We present a discrete coverage algorithm which converges to a centroidal Voronoi partition while requiring only pairwise “gossip” communication between the agents. Our theoretical analysis is based on a dynamical system on pa...
متن کاملCode Partitioning in Decoupled Compilers
Decoupled access/execute architectures seek to maximize performance by dividing a given program into two separate instruction streams and executing the streams on independent cooperating processors. The instruction streams consist of those instructions involved in generating memory accesses (the Access stream) and those that consume the data (the Execute stream). If the processor running the ac...
متن کاملPartitioning object-oriented source code for inspections
Software inspections are used for the detection of defects in various types of documents produced during the software development life-cycle. An inspection consists of the manual scrutiny of a software document, with the aim of detecting defects. Inspections complement existing automated fault detection techniques such as testing because they find different types of faults and the inspector has...
متن کاملGOSSIP: Gossip Over Storage Systems Is Practical
Gossip-based mechanisms are touted for their simplicity, limited resource usage, robustness to failures, and tunable system behavior. These qualities make gossiping an ideal mechanism for storage systems that are responsible for maintaining and updating data in a mist of failures and limited resources (e.g., intermittent network connectivity, limited bandwidth, constrained communication range, ...
متن کاملPartitioning Non-strict Functional Languages for Partitioning Non-strict Functional Languages for Multi-threaded Code
In this paper, we present a new approach to partitioning, the problem of generating sequential threads for programs written in a non-strict functional language. The goal of partitioning is to generate threads as large as possible, while retaining the non-strict semantics of the program. We deene partitioning as a program transformation and design algorithms for basic block partitioning and inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGOPS Operating Systems Review
سال: 2010
ISSN: 0163-5980
DOI: 10.1145/1713254.1713264